Parameterized (Approximate) Defective Coloring
نویسندگان
چکیده
منابع مشابه
Parameterized (Approximate) Defective Coloring
In Defective Coloring we are given a graph G = (V,E) and two integers χd,∆ and are asked if we can partition V into χd color classes, so that each class induces a graph of maximum degree ∆∗. We investigate the complexity of this generalization of Coloring with respect to several well-studied graph parameters, and show that the problem is W-hard parameterized by treewidth, pathwidth, tree-depth,...
متن کاملParameterized Maximum Path Coloring
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the i...
متن کاملDefective coloring revisited
A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of such colorings in surfaces and the complexity of coloring problems. It is shown that a toroidal graph is (3, 2)and (5, 1)-colorable, and that a graph of genus γ is (χγ/(d + 1) + 4, d)-colorable, where χγ ...
متن کاملDefective circular coloring
The concept of a defective circular coloring is introduced, and results shown for planar, series-parallel, and outerplanar graphs. Numerous problems are also stated.
متن کاملApproximate coloring of uniform
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of nding the exact value of the chromatic number of a hypergraph is known to be NP -hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1223666